// Problem 024: Lexicographic permutations
// A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:	012   021   102   120   201   210
// What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?
// --------
// 2! =       2
// 3! =       6
// 4! =      24
// 5! =     120
// 6! =     720
// 7! =    5040
// 8! =   40320
// 9! =  362880
// 10!= 3628800
// 0~ and 1~ take 2*362880=725760, 274240 remains.
// 2[013456]~ take 6*40320=241920, 32320 remains.
// 27[013456]~ take 6*5040=30240, 2080 remains.
// 278[01]~ take 2*720=1440, 640 remains.
// 2783[01456]~ take 5*120=600, 40 remains.
// 278390~ take 24, 16 remains.
// 278391[04] take 2*6=12, 4 remains.
// 2783915[04] take 2*2=4, 0 remains.
// The last is the latter/bigger among 27839154** (2783915406,2783915460).

package main

import (
	"fmt"
)

func p024() {
	fmt.Println("Problem 024: 2783915460")
}
